Large Deviation Result for the Empirical Locality Measure of Typed Random Geometric Graphs
نویسندگان
چکیده
منابع مشابه
Joint large deviation result for empirical measures of the coloured random geometric graphs
We prove joint large deviation principle for the empirical pair measure and empirical locality measure of the near intermediate coloured random geometric graph models on n points picked uniformly in a d-dimensional torus of a unit circumference. From this result we obtain large deviation principles for the number of edges per vertex, the degree distribution and the proportion of isolated vertic...
متن کاملLocal Large deviations for empirical locality measure of typed Random Graph Models
Abstract. In this article, we prove a local large deviation principle (LLDP) for the empirical locality measure of typed random networks on n nodes conditioned to have a given empirical type measure and empirical link measure. From the LLDP, we deduce a full large deviation principle for the typed random graph, and the classical Erdos-Renyi graphs, where nc/2 links are inserted at random among ...
متن کاملLarge Deviation Principles for Empirical Measures of Coloured Random Graphs
Abstract. For any finite coloured graph we define the empirical neighbourhood measure, which counts the number of vertices of a given colour connected to a given number of vertices of each colour, and the empirical pair measure, which counts the number of edges connecting each pair of colours. For a class of models of sparse coloured random graphs, we prove large deviation principles for these ...
متن کاملOn Locality in Geometric Random Graphs
We address the question of locality in random graphs. In particular, we study a geometric random tree model Tα,n which is a variant of the FKP model proposed in [FKP02]. We choose vertices v1, . . . , vn in some convex body uniformly and fix a point o. We then build our tree inductively, where at time t we add an edge from vt to the vertex in v1, . . . , vt−1 which minimizes α‖vt − vi‖ + ‖vi − ...
متن کاملJoint Large Deviation principle for empirical measures of the d-regular random graphs
For a $d-$regular random model, we assign to vertices $q-$state spins. From this model, we define the \emph{empirical co-operate measure}, which enumerates the number of co-operation between a given couple of spins, and \emph{ empirical spin measure}, which enumerates the number of sites having a given spin on the $d-$regular random graph model. For these empirical measures we obtain large devi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Statistics and Probability
سال: 2015
ISSN: 1927-7040,1927-7032
DOI: 10.5539/ijsp.v4n1